n = int(input())
w = list(map(int, input().split()))
W = int(input())
count = 0


def dfs(tw, rw, i):
    global n, w, W, count
    if i >= n:
        if tw == W:
            count += 1
    else:
        rw -= w[i]
        if (tw + w[i]) <= W:
            dfs(tw + w[i], rw, i + 1)
        if (tw + rw) >= W:
            dfs(tw, rw, i + 1)


rw = 0
for i in w:
    rw += i

dfs(0, rw, 0)
if count > 0:
    print("Yes")
else:
    print("No")
